Maximum a posteriori estimation through simulated annealing for binary asteroid orbit determination
نویسندگان
چکیده
منابع مشابه
Simulated annealing for maximum a Posteriori parameter estimation of hidden Markov models
Hidden Markov models are mixture models in which the populations from one observation to the next are selected according to an unobserved finite state-space Markov chain. Given a realization of the observation process, our aim is to estimate both the parameters of the Markov chain and of the mixture model in a Bayesian framework. In this paper, we present an original simulated annealing algorit...
متن کاملMaximum a posteriori maximum entropy order determination
An instance crucial to most problems in signal processing is the selection of the order of a presupposed model. Examples are the determination of the putative number of signals present in white Gaussian noise or the number of noise-contaminated sources impinging on a passive sensor array. It is shown that Maximum a Posteriori Bayesian arguments, coupled with Maximum Entropy considerations, offe...
متن کاملAdaptive Simulated Annealing for maximum temperature
It is difficult to determine the appropriate temperature parameters which control the acceptance probability in Simulated Annealing, which is a typical meta-heuristic method in the optimization methods. In this paper, we propose a new simulated annealing method that determines the maximum temperature adaptively. The proposed method is base on an important temperature where optimum solutions wer...
متن کاملA simulated annealing heuristic for maximum correlation core/periphery partitioning of binary networks
A popular objective criterion for partitioning a set of actors into core and periphery subsets is the maximization of the correlation between an ideal and observed structure associated with intra-core and intra-periphery ties. The resulting optimization problem has commonly been tackled using heuristic procedures such as relocation algorithms, genetic algorithms, and simulated annealing. In thi...
متن کاملA simulated annealing for reconstructing hv-convex binary matrices
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two projections. This variant is reformulated as an integer programming problem and approximated by simulated annealing approach.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2017
ISSN: 0035-8711,1365-2966
DOI: 10.1093/mnras/stx1899